A note on the complexity of the maximum edge clique partitioning problem with respect to clique number
نویسندگان
چکیده
The maximum edge clique partitioning problem (Max-ECP) was considered by Dessmark et al. (2007) as a tool for DNA clone classification, and is known to be NP-hard on graphs with clique number 3. This complexity result was demonstrated by Punnen and Zhang (2012), however, their proof is incorrect. In this note, we give several complexity results of Max-ECP with respect to clique number, which include a new proof of the above claim.
منابع مشابه
Computing Multiplicative Zagreb Indices with Respect to Chromatic and Clique Numbers
The chromatic number of a graph G, denoted by χ(G), is the minimum number of colors such that G can be colored with these colors in such a way that no two adjacent vertices have the same color. A clique in a graph is a set of mutually adjacent vertices. The maximum size of a clique in a graph G is called the clique number of G. The Turán graph Tn(k) is a complete k-partite graph whose partition...
متن کاملLower bounds on the signed (total) $k$-domination number
Let $G$ be a graph with vertex set $V(G)$. For any integer $kge 1$, a signed (total) $k$-dominating functionis a function $f: V(G) rightarrow { -1, 1}$ satisfying $sum_{xin N[v]}f(x)ge k$ ($sum_{xin N(v)}f(x)ge k$)for every $vin V(G)$, where $N(v)$ is the neighborhood of $v$ and $N[v]=N(v)cup{v}$. The minimum of the values$sum_{vin V(G)}f(v)$, taken over all signed (total) $k$-dominating functi...
متن کاملA Note on a graph associated to a commutative ring
The rings considered in this article are commutative with identity. This article is motivated by the work on comaximal graphs of rings. In this article, with any ring $R$, we associate an undirected graph denoted by $G(R)$, whose vertex set is the set of all elements of $R$ and distinct vertices $x,y$ are joined by an edge in $G(R)$ if and only if $Rxcap Ry = Rxy$. In Section 2 of this articl...
متن کاملComplexity Results on Graphs with Few Cliques
A graph class has few cliques if there is a polynomial bound on the number of maximal cliques contained in any member of the class. This restriction is equivalent to the requirement that any graph in the class has a polynomial sized intersection representation that satisfies the Helly property. On any such class of graphs some problems that are NP-complete on general graphs, such as the maximum...
متن کاملConvex relaxation for the planted clique, biclique, and clustering problems
A clique of a graph G is a set of pairwise adjacent nodes of G. Similarly, a biclique(U, V ) of a bipartite graph G is a pair of disjoint, independent vertex sets such that eachnode in U is adjacent to every node in V in G. We consider the problems of identifyingthe maximum clique of a graph, known as the maximum clique problem, and identifyingthe biclique (U, V ) of a bipartite...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013